A Novel (t, n) Threshold Secret Sharing Using Dot Product of Linearly Independent Vectors
نویسندگان
چکیده
Threshold schemes are ideally suited to situations where a group of mutually suspicious individuals with conflicting interests must cooperate. The schemes allow a user to divide portions of a secret among a participants group. Any t or more participants from a participants group of n members can cooperate to regain the original secret while (t-1) or fewer participants cannot reveal anything about the original secret. In this paper we proposed a (t, n) threshold secret sharing scheme using dot product of linearly independent vectors and Vandermonde matrix. The proposed scheme is ideal as share size is same as secret, perfect as (t-1) participants cannot retrieve any information about the secret and secure as based on dot product of problem. Also the proposed scheme can be extended for additional capabilities of secret sharing using properties of dot product of vectors.
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملA Threshold-based Model for Privacy Protection in Cloud Computing
Privacy for cloud computing has become an important issue in recent years. In this paper, we propose a threshold-based model for privacy protection in cloud computing with a particular (n +1, t +1) secret sharing scheme which is bases on the matrix and vector. We show how our (n +1, t +1) secret sharing scheme can be applied to protect privacy. First, we assign each row of the matrix as a key o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013